Instruction sequence expressions for the secure hash algorithm SHA-256

نویسندگان

  • Jan A. Bergstra
  • Kees Middelburg
چکیده

The secure hash function SHA-256 is a function on bit strings. This means that its restriction to the bit strings of any given length can be computed by a finite instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructions, and a termination instruction. We describe such instruction sequences for the restrictions to bit strings of the different possible lengths by means of uniform terms from an algebraic theory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Keyed/Unkeyed SHA-2

In the draft FIPS 180-2, NIST published SHA-2 as a new version of secure hash algorithm. SHA-2 offers four secure hash algorithms including SHA-1, SHA-256, SHA-384, and SHA-512. In other words, SHA-2 may have outputs 160, 256, 384, or 512 bits of message digest. However, SHA-2 algorithm uses fixed and predefined parameters in execution. It may be vulnerable to attacks. In this paper, we propose...

متن کامل

Algebraic Fault Attack on the Sha-256 Compression Function

The cryptographic hash function SHA-256 is one member of the SHA-2 hash family, which was proposed in 2000 and was standardized by NIST in 2002 as a successor of SHA-1. Although the differential fault attack on SHA-1compression function has been proposed, it seems hard to be directly adapted to SHA-256. In this paper, an efficient algebraic fault attack on SHA-256 compression function is propos...

متن کامل

An Improved Fast and Secure Hash Algorithm

Recently, a fast and secure hash function SFHA – 256 has been proposed and claimed as more secure and as having a better performance than the SHA – 256. In this paper an improved version of SFHA – 256 is proposed and analyzed using two parameters, namely the avalanche effect and uniform deviation. The experimental results and further analysis ensures the performance of the newly proposed and im...

متن کامل

Secure Bio-Cryptographic Authentication System for Cardless Automated Teller Machines

Security is a vital issue in the usage of Automated Teller Machine (ATM) for cash, cashless and many off the counter banking transactions. Weaknesses in the use of ATM machine could not only lead to loss of customer’s data confidentiality and integrity but also breach in the verification of user’s authentication. Several challenges are associated with the use of ATM smart card such as: card clo...

متن کامل

Performance Comparison of Parallel Implementations of Cayley and SHA Hash Functions

Implementing hash functions to run on multi-core computers will reduce its running time. We aim to implement Cayley, SHA-256 and SHA-512 hash functions to run on multicore computers and compare their performances. Cayley hash compresses the input message by hashing one bit at a time using composition of linear equations. SHA-256 and SHA-512 work on message blocks and produce fixed length digest...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1308.0219  شماره 

صفحات  -

تاریخ انتشار 2013